Edge splitting and connectivity augmentation in directed hypergraphs
نویسندگان
چکیده
We prove theorems on edge splittings and edge-connectivity augmentation in directed hypergraphs, extending earlier results of Mader and Frank, respectively, on directed graphs. MSC Classification: 05C40, 05C65, 05C85, 05C20
منابع مشابه
A note on hypergraph connectivity augmentation
We prove an abstract version of an edge-splitting theorem for directed hypergraphs that appeared in [1], and use this result to obtain min-max theorems on hypergraph augmentation problems that are linked to orientations. These problems include (k, l)-edge-connectivity augmentation of directed hypergraphs, and (k, l)-partition-connectivity augmentation of undirected hypergraphs by uniform hypere...
متن کاملEdge-connectivity of undirected and directed hypergraphs
The objective of the thesis is to discuss edge-connectivity and related connectivity conceptsin the context of undirected and directed hypergraphs. In particular, we focus on k-edge-connectivity and (k, l)-partition-connectivity of hypergraphs, and (k, l)-edge-connectivityof directed hypergraphs. A strong emphasis is placed on the role of submodularity in thestructural aspects o...
متن کاملCovering symmetric supermodular functions by graphs
The minimum number of edges of an undirected graph covering a symmetric , supermodular set-function is determined. As a special case, we derive an extension of a theorem of J. Bang-Jensen and B. Jackson on hypergraph connectivity augmentation. 0. INTRODUCTION T. Watanabe and A. Nakamura 1987] proved a min-max formula for the minimum number of new edges whose addition to a given undirected graph...
متن کاملAugmenting Hypergraphs to Meet Local Connectivity Requirements
We consider aspects of vertex splitting and connectivity augmentation in hypergraphs. In the splitting problem we are given a hypergraph G = (V + s, E) in which s is only incident with edges of size two and asked to “split” s in such a way that we preserve the local-connectivity in the set V . We develop results that lead to a characterisation of the hypergraphs in which there is no such split....
متن کاملEdge-connectivity of permutation hypergraphs
In this note we provide a generalization of a result of Goddard, Raines and Slater [4] on edge-connectivity of permutation graphs for hypergraphs. A permutation hypergraph Gπ is obtained from a hypergraph G by taking two disjoint copies of G and by adding a perfect matching between them. The main tool in the proof of the graph result was the theorem on partition constrained splitting off preser...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 273 شماره
صفحات -
تاریخ انتشار 2003